Community detection based on links and node features in social networks

© Springer International Publishing Switzerland 2015. Community detection is a significant but challenging task in the field of social network analysis. Many effective methods have been proposed to solve this problem. However, most of them are mainly based on the topological structure or node attributes. In this paper, based on SPAEM [1], we propose a joint probabilistic model to detect community which combines node attributes and topological structure. In our model, we create a novel feature-based weighted network, within which each edge weight is represented by the node feature similarity between two nodes at the end of the edge. Then we fuse the original network and the created network with a parameter and employ expectation-maximization algorithm (EM) to identify a community. Experiments on a diverse set of data, collected from Facebook and Twitter, demonstrate that our algorithm has achieved promising results compared with other algorithms

An Automated Algorithm for Extracting Website Skeleton

The huge amount of information available on the Web has attracted many research e#orts into developing wrappers that extract data from webpages. However, as most of the systems for generating wrappers focus on extracting data at page-level, data extraction at site-level remains a manual or semi-automatic process. In this paper, we study the problem of extracting website skeleton, i.e. extracting the underlying hyperlink structure that is used to organize the content pages in a given website. We propose an automated algorithm, called the Sew algorithm, to discover the skeleton of a website. Given a page, the algorithm examines hyperlinks in groups and identifies the navigation links that point to pages in the next level in the website structure. The entire skeleton is then constructed by recursively fetching pages pointed by the discovered links and analyzing these pages using the same process. Our experiments on real life websites show that the algorithm achieves a high recall with moderate precision

Search in Power-Law Networks

Many communication and social networks have power-law link distributions, containing a few nodes which have a very high degree and many with low degree. The high connectivity nodes play the important role of hubs in communication and networking, a fact which can be exploited when designing efficient search algorithms. We introduce a number of local search strategies which utilize high degree nodes in power-law graphs and which have costs which scale sub-linearly with the size of the graph. We also demonstrate the utility of these strategies on the Gnutella peer-to-peer network.Comment: 17 pages, 14 figure

Path finding strategies in scale-free networks

We numerically investigate the scale-free network model of Barab{\'a}si and Albert [A. L. Barab{\'a}si and R. Albert, Science {\bf 286}, 509 (1999)] through the use of various path finding strategies. In real networks, global network information is not accessible to each vertex, and the actual path connecting two vertices can sometimes be much longer than the shortest one. A generalized diameter depending on the actual path finding strategy is introduced, and a simple strategy, which utilizes only local information on the connectivity, is suggested and shown to yield small-world behavior: the diameter $D$ of the network increases logarithmically with the network size $N$, the same as is found with global strategy. If paths are sought at random, $D \sim N^{0.5}$ is found.Comment: 4 pages, final for

Infections in Biological and Targeted Synthetic Drug Use in Rheumatoid Arthritis:Where do We Stand? A Scoping Review and Meta-analysis

Introduction: The advent of biological and targeted synthetic therapies has revolutionized rheumatoid arthritis (RA) treatment. However, this has come at the price of an increased risk of infections. The aim of this study was to present an integrated overview of both serious and non-serious infections, and to identify potential predictors of infection risk in RA patients using biological or targeted synthetic drugs. Methods: We systematically reviewed available literature from PubMed and Cochrane and performed multivariate meta-analysis with meta-regression on the reported infections. Randomized controlled trials and prospective and retrospective observational studies including patient registry studies were analyzed, combined as well as separately. We excluded studies focusing on viral infections only. Results: Infections were not reported in a standardized manner. Meta-analysis showed significant heterogeneity that persisted after forming subgroups by study design and follow-up duration. Overall, the pooled proportions of patients experiencing an infection during a study were 0.30 (95% CI, 0.28–0.33) and 0.03 (95% CI, 0.028–0.035) for any kind of infections or serious infections only, respectively. We found no potential predictors that were consistent across all study subgroups. Conclusions: The high heterogeneity and the inconsistency of potential predictors between studies show that we do not yet have a complete picture of infection risk in RA patients using biological or targeted synthetic drugs. Besides, we found non-serious infections outnumbered serious infections by a factor 10:1, but only a few studies have focused on their occurrence. Future studies should apply a uniform method of infectious adverse event reporting and also focus on non-serious infections and their impact on treatment decisions and quality of life.</p

Large-scale structural organization of social networks

The characterization of large-scale structural organization of social networks is an important interdisciplinary problem. We show, by using scaling analysis and numerical computation, that the following factors are relevant for models of social networks: the correlation between friendship ties among people and the position of their social groups, as well as the correlation between the positions of different social groups to which a person belongs.Comment: 5 pages, 3 figures, Revte

Correlation effects in a simple model of small-world network

We analyze the effect of correlations in a simple model of small world network by obtaining exact analytical expressions for the distribution of shortest paths in the network. We enter correlations into a simple model with a distinguished site, by taking the random connections to this site from an Ising distribution. Our method shows how the transfer matrix technique can be used in the new context of small world networks.Comment: 10 pages, 3 figure

Factors Affecting Web Page Similarity

Abstract. Tools that allow effective information organisation, access and navigation are becoming increasingly important on the Web. Sim-ilarity between web pages is a concept that is central to such tools. In this paper, we examine the effect that content and layout-related as-pects of web pages have on web page similarity. We consider the textual content contained within common HTML tags, the structural layout of pages, and the query terms contained within pages. Our study shows that combinations of factors can yield more promising results than individual factors, and that different aspects of web pages affect similarities between pages in a different manner. We found a number of factors that, when taken into account, can result in effective measures of similarity between web pages. Query information in particular, proved to be important for the effective organisation of web pages.

Measuring user influence, susceptibility and cynicalness in sentiment diffusion

National Research Foundation (NRF) Singapore under International Research Centre @ Singapore Funding Initiativ